Interactive Timed Simulation of Distributed Systems - From PROMELA to PROMELA+
نویسندگان
چکیده
Simulation is a powerful tool in the development cycle of distributed systems; it has long been studied and practiced. The present paper presents an approach to timed interactive simulation based on the execution of timed CSP-like models; the language presented is PROMELA+, derived from PROMELA with the extension to temporal quantification. The whole simulation environment, named YES, includes also a statistical analyzer which requests to the executor as many samples as needed to generate the desired estimators with the
منابع مشابه
Translation of Timed Promela to Timed Automata with Discrete Data
The aim of the work is twofold. In order to face the problem of modeling time constraints in Promela, a timed extension of the language is presented. Next, timed Promela is translated to timed automata with discrete data, that is timed automata extended with integer variables. The translation enables verification of Promela specifications via tools accepting timed automata as input, such as Ver...
متن کاملType inference and strong static type checking for Promela
The SPIN model checker and its specification language Promela have been used extensively in industry and academia to check logical properties of distributed algorithms and protocols. Model checking with SPIN involves reasoning about a system via an abstract Promela specification, thus the technique depends critically on the soundness of this specification. Promela includes a rich set of data ty...
متن کاملFrom Helena Ensemble Speci cations to Promela Veri cation Models
With Helena, we introduced a modeling approach for distributed systems where components dynamically collaborate in ensembles. Conceptually, components participate in a goal-oriented collaboration by adopting certain roles in the ensemble. To verify the goal-directed behavior of ensembles, we propose to systematically translate Helena speci cations to Promela and verify them with the model-check...
متن کاملDirected Model Checking for PROMELA with Relaxation-Based Distance Functions
Directed model checking uses distance functions to guide the state space exploration to efficiently find short error paths. Distance functions based on delete-relaxation have successfully been used for, e.g., model checking timed automata. However, such distance functions have not been investigated for formalisms with rich expression languages as provided by PROMELA. We present a generalization...
متن کاملRestricting DEv-PROMELA with a hierarchy of simulation formalisms
The DEv-PROMELA formalism is a new formalism that allows combining formal verification and discrete event simulation. In this paper, we propose to use a hierarchy of simulation formalisms to restrict the DEvPROMELA language. From sequential machine to the most expressive DEv-PROMELA formalism, this hierarchy helps designers to design models and to analyze systems in a progressive manner.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995